{ Statement: http://informatics.mccme.ru/moodle/mod/statements/view3.php?chapterid=758
  Verdict: Accepted
}
uses
	SysUtils, Math;
 
var
	i,n:longint;
	k:int64;
	a:array[0..100010] of int64;
 
procedure sort(l,r:longint);
 
var
	i,j,x,y:longint;
 
begin
i := l;
j := r;
x := a[(l + r) shr 1];
repeat
	while a[i] > x do inc(i);
	while a[j] < x do dec(j);
	if i <= j then begin
		y := a[i];
		a[i] := a[j];
		a[j] := y;
		inc(i);
		dec(j);
	end;
until i > j;
if l < j then sort(l, j);
if i < r then sort(i, r);
end;
 
begin
reset(input,'input.txt');
rewrite(output,'output.txt');
read(k);
n := 0;
while k <> 0 do begin
	inc(n);
	a[n] := k;
	read(k);
end;
sort(1, n);
k := 1;
for i := 2 to n do begin
	if a[i] <> a[i - 1] then inc(k);
end;
write(k);
end.